A Semantic Characterization of Full Abstraction for Typed Lambda Calculi
نویسنده
چکیده
منابع مشابه
On the Expressive Power of Simply Typed and Let-Polymorphic Lambda Calculi
We present a functional framework for descriptive computational complexity, in which the Regular, First-and Elementary sets have syntactic characterizations. In this framework, typed lambda terms represent inputs and outputs as well as programs. The lambda calculi describing the above computational complexity classes are simply or let-polymorphically typed with function-alities of xed order. Th...
متن کاملA Characterization of lambda Definability in Categorical Models of Implicit Polymorphism
Lambda deenability is characterized in categorical models of simply typed lambda calculus with type variables. A category-theoretic framework known as glueing or sconing is used to extend the Jung-Tiuryn characterization of lambda deenability JuT93], rst to ccc models, and then to categorical models of the calculus with type variables. Logical relations are now a well-established tool for study...
متن کاملOn Probabilistic Applicative Bisimulation and Call-by-Value $\lambda$-Calculi (Long Version)
Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is generalized to a typed, call-by-value, lambda-calculus. Surprisingly, the obtained relation coincides with context equivalence, contrary to what happens when call-by-name evaluation is considered. Even more sur...
متن کاملThe Penn Lambda Calculator: Pedagogical Software for Natural Language Semantics
This paper describes a novel pedagogical software program that can be seen as an online companion to one of the standard textbooks of formal natural language semantics, Heim and Kratzer (1998). The Penn Lambda Calculator is a multifunctional application designed for use in standard graduate and undergraduate introductions to formal semantics: Teachers can use the application to demonstrate comp...
متن کاملProbabilistic Applicative Bisimulation and Call-by-Value λ-Calculi (Long Version)
Probabilistic applicative bisimulation is a recently introduced coinductive methodology for program equivalence in a probabilistic, higher-order, setting. In this paper, the technique is generalized to a typed, call-by-value, lambda-calculus. Surprisingly, the obtained relation coincides with context equivalence, contrary to what happens when call-by-name evaluation is considered. Even more sur...
متن کامل